Občina Brežice – obmejnost kot priložnost brezmejnih možnosti. 16. geografski raziskovalni tabor, Brežice, 7.–15. 7. 2012
نویسندگان
چکیده
منابع مشابه
Forum Math. 16 (2004), 695–715
Let us consider two closed homeomorphic manifolds M;N of class C 1 and two functions j : M ! R, c : N ! R of class C . The natural pseudodistance d between the pairs ðM; jÞ; ðN;cÞ is defined as the infimum of Yð f Þ 1⁄4 def maxP AMjjðPÞ cð f ðPÞÞj, as f varies in the set of all homeomorphisms from M onto N. In this paper we prove that a suitable multiple of d by a positive integer k coincides w...
متن کامل2012-08-16-117 Paratuberculosis databases updated (2012-08-16)
Sardinia acts as an ideal setting for multiple sclerosis (MS) studies because its prevalence of MS is one of the highest worldwide. Several pathogens have been investigated amongst 119 Sardinian MS patients and 117 healthy controls to determine whether they might have a role in triggering MS in genetically predisposed individuals. Mycobacterium avium subsp. paratuberculosis (MAP) and Epstein Ba...
متن کاملUTMS 2012 – 16 November 14 , 2012
We establish an isoperimetric inequality with constraint by ndimensional lattices. We prove that, among all domains which consist of rectangular parallelepipeds with the common side-lengths, a cube is the best shape to minimize the ratio involving its perimeter and volume as long as the cube is realizable by the lattice. For its proof a solvability of finite difference PoissonNeumann problems i...
متن کاملL 16 — April 19 , 2012
In this lecture, we consider the string matching problem finding some or all places in a text where the query string occurs as a substring. From the perspective of a one-shot approach, we can solve string matching in O(|T |) time, where |T | is the size of our text. This purely algorithmic approach has been studied extensively in the papers by Knuth-Morris-Pratt [6], Boyer-Moore [1], and Rabin-...
متن کاملLecture 16 - March 22 , 2012
In the last lecture we talked about how to support dynamic graphs with respect to operations which included insertion and deletion of edges and looking for existence of path between two vertices. In this lecture we will talk about supporting all pair shortest paths along with addition, deletion and updation of edges in O(n2 log n) amortized time on the graphs with non negative real-valued edge ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Dela
سال: 2013
ISSN: 1854-1089,0354-0596
DOI: 10.4312/dela.40.279-280